One-parameter fixed point indices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One Parameter Fixed Point Theory and Gradient Flows of Closed 1-forms

We use the one-parameter fixed point theory of Geoghegan and Nicas to get information about the closed orbit structure of transverse gradient flows of closed 1-forms on a closed manifold M . We define a noncommutative zeta function in an object related to the first Hochschild homology group of the Novikov ring associated to the 1-form and relate it to the torsion of a natural chain homotopy equ...

متن کامل

Fixed Point Indices and Invariant Periodic Sets of Holomorphic Systems

This note presents a method to study center families of periodic orbits of complex holomorphic differential equations near singularities, based on some iteration properties of fixed point indices. As an application of this method, we will prove Needham’s theorem in a more general version. 1. Fixed point indices of holomorphic mappings Let C be the complex vector space of dimension n, let U be a...

متن کامل

Fixed Point Indices and Periodic Points of Holomorphic Mappings

Let ∆ be the ball |x| < 1 in the complex vector space C, let f : ∆ → C be a holomorphic mapping and let M be a positive integer. Assume that the origin 0 = (0, . . . , 0) is an isolated fixed point of both f and the M -th iteration f of f . Then for each factor m of M, the origin is again an isolated fixed point of f and the fixed point index μfm(0) of f m at the origin is well defined, and so ...

متن کامل

Brouwer's fixed point theorem with sequentially at most one fixed point

We present a constructive proof of Brouwer’s fixed point theorem with sequentially at most one fixed point, and apply it to the mini-max theorem of zero-sum games.

متن کامل

Fixed Parameter Algorithms for one-sided crossing minimization Revisited

We exhibit a small problem kernel for the problem onesided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we improve on the search tree algorithm developed in [5] and derive an O(1.4656k + kn) algorithm for this problem, where k upperbounds the number of tolerated crossings of straight lines involved in the draw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1994

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1994.164.263